On the problem on M-hyperquasivarieties
نویسندگان
چکیده
The aim of this paper is to present a solution of the problem 32 posed by K. Denecke and S.L. Wismath in [18]. It is a continuation of common results of the author and Dietmar Schweigert presented in joint papers [34] and [36] – [40]. The results of this paper were partially presented during the conference Trends in Logic III International in Memoriam Andrzej Mostowski, Helena Rasiowa, Cecylia Rauszer, Warsaw, September 23, Ruciane-Nida, September 24-25, 2005 and on the Workshop AAA71 and CYA21 in Bȩdlewo, Polish Academy of Sciences, Poland on February 11, 2006.
منابع مشابه
On the Problem of Basis for Hyperquasivarieties
Our aim is to present a solution of the Problem 31 of Chapter 8 of [5] by presenting a general theorem on hyper-quasi-identities considered as hyperbasis for solid quasi-varieties. In the last section we point out also a generalization of that result for the notion of M-hyper-quasi-identities. The results were presented at AAA68 Conference at Technische Universität Dresden, June 13, 2004.
متن کاملOn the Problem of M-hyperquasivarieties *
The aim of this paper is to present a solution of the problem 32 posed by K. Denecke and S.L. Wismath in their book [15]. ∗The results of this paper were partially presented during the conference Trends in Logic III International in memoriam Andrzej Mostowski, Helena Rasiowa, Cecylia Rauszer, Warsaw, September 23, Ruciane-Nida, September 24–25, 2005 and on the 71 Workshop on General Algebra tog...
متن کاملM -hyperquasi-identities of Finite Algebras *
In [4] (see [2]) the notion of a hypersubstitution of a given type and the notion of a derived variety D(V ) of a given variety V of a fixed type τ were invented. Suitable hyperequational calculus appeared as a modification of G. Birkhoff calculus with additional rule called hypersubstitution rule (6). In Graczyńska E. and Schweigert D. [6] we considered further generalization to M-hyperquasiva...
متن کاملOn the inverse maximum perfect matching problem under the bottleneck-type Hamming distance
Given an undirected network G(V,A,c) and a perfect matching M of G, the inverse maximum perfect matching problem consists of modifying minimally the elements of c so that M becomes a maximum perfect matching with respect to the modified vector. In this article, we consider the inverse problem when the modifications are measured by the weighted bottleneck-type Hamming distance. We propose an alg...
متن کاملTriple positive solutions of $m$-point boundary value problem on time scales with $p$-Laplacian
In this paper, we consider the multipoint boundary value problem for one-dimensional $p$-Laplacian dynamic equation on time scales. We prove the existence at least three positive solutions of the boundary value problem by using the Avery and Peterson fixed point theorem. The interesting point is that the non-linear term $f$ involves a first-order derivative explicitly. Our results ...
متن کامل